منابع مشابه
A high order ADI method for separable generalized Helmholtz equations
We present a multilevel high order ADI method for separable generalized Helmholtz equations. The discretization method we use is a onedimensional fourth order compact finite difference applied to each directional component of the Laplace operator, resulting in a discrete system efficiently solvable by ADI methods. We apply this high order difference scheme to all levels of grids, and then start...
متن کاملTensor Product Generalized ADI Methods for Elliptic Problems
We collsider IlOlving separable, second order. linear elliptic partial differential equations. If an elliptic problem is separable, then, for certain discretizations. the matrices involved in the corresponding discrete problem can be expressed in terms of tensor products of lower order matrices. In the most general case. the discrete problem can be written in the form (Al@Bz +81i&lA,2)C ==F. We...
متن کاملPreconditioning of a Generalized Forward-Backward
We present a preconditioning of a generalized forward-backward splitting algorithm for nding a zero of a sum of maximally monotone operators∑ni=1 A i + B with B cocoercive, involving only the computation of B and of the resolvent of each A i separately. is allows in particular to minimize functionals of the form∑ni=1 дi + f with f smooth, using only the gradient of f and the proximity operator...
متن کاملGeneralized Preconditioning and Network Flow Problems
We consider approximation algorithms for the problem of finding x of minimal norm ‖x‖ satisfying a linear system Ax = b, where the norm ‖ · ‖ is arbitrary and generally non-Euclidean. We show a simple general technique for composing solvers, converting iterative solvers with residual error ‖Ax−b‖ ≤ t−Ω(1) into solvers with residual error exp(−Ω(t)), at the cost of an increase in ‖x‖, by recursi...
متن کاملAdi Shamir And
A major problem in using iterative number generators of the form xi = f(xi−1) is that they can enter unexpectedly short cycles. This is hard to analyze when the generator is designed, hard to detect in real time when the generator is used, and can have devastating cryptanalytic implications. In this paper we define a measure of security, called sequence diversity, which generalizes the notion o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1984
ISSN: 0898-1221
DOI: 10.1016/0898-1221(84)90076-2